Sperner spaces and first-order logic

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sperner spaces and first-order logic

E. Sperner [8] introduced a generalized notion of affine space, to be referred to as a Sperner space, which he showed how to represent algebraically by means of so-called quasimodules. His paper has generated a sizable literature. The axiom system given in [8] is phrased in a two-sorted language , with individual variables ranging over points and lines, and with two primitive notions, that of p...

متن کامل

First-Order Logic, Second-Order Logic, and Completeness

Both firstand second-order logic (FOL and SOL, respectively) as we use them today were arguably created by Frege in his Begriffsschrift – if we ignore the notational differences. SOL also suggests itself as a natural, and because of its much greater strength, desirable extension of FOL. But at least since W. V. Quine’s famous claim that SOL is “set theory in sheep’s clothing” it is widely held ...

متن کامل

First Order Logic, Fixed Point Logic and Linear Order

The Ordered conjecture of Kolaitis and Vardi asks whether xed point logic di ers from rst order logic on every in nite class of nite ordered structures In this paper we develop the tool of bounded variable element types and illustrate its application to this and the orig inal conjectures of McColm which arose from the study of inductive de nability and in nitary logic on pro cient classes of ni...

متن کامل

Indistinguishability and First-Order Logic

The “richness” of properties that are indistinguishable from first-order properties is investigated. Indistinguishability is a concept of equivalence among properties of combinatorial structures that is appropriate in the context of testability. All formulas in a restricted class of second-order logic are shown to be indistinguishable from first-order formulas. Arbitrarily hard properties, incl...

متن کامل

Homomorphisms and First-Order Logic

We prove that the homomorphism preservation theorem (h.p.t.), a classical result of mathematical logic, holds when restricted to finite structures. That is, a first-order formula is preserved under homomorphisms on finite structures if, and only if, it is equivalent in the finite to an existential-positive formula. This result, which contrasts with the known failure of other classical preservat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: MLQ

سال: 2003

ISSN: 0942-5616,1521-3870

DOI: 10.1002/malq.200310011